Majority Bootstrap Percolation on $G(n,p)$
نویسندگان
چکیده
منابع مشابه
Majority Bootstrap Percolation on G(n, p)
Majority bootstrap percolation on a graph G is an epidemic process defined in the following manner. Firstly, an initially infected set of vertices is selected. Then step by step the vertices that have at least half of its neighbours infected become infected. We say that percolation occurs if eventually all vertices in G become infected. In this paper we provide sharp bounds for the critical siz...
متن کاملMajority Bootstrap Percolation on the Hypercube
In majority bootstrap percolation on a graph G, an infection spreads according to the following deterministic rule: if at least half of the neighbours of a vertex v are already infected, then v is also infected, and infected vertices remain infected forever. Percolation occurs if eventually every vertex is infected. The elements of the set of initially infected vertices, A ⊂ V (G), are normally...
متن کاملStrict majority bootstrap percolation in the r-wheel
In the strict Majority Bootstrap Percolation process each passive vertex v becomes active if at least ⌈ 2 ⌉ of its neighbors are active (and thereafter never changes its state). We address the problem of finding graphs for which a small proportion of initial active vertices is likely to eventually make all vertices active. We study the problem on a ring of n vertices augmented with a “central” ...
متن کاملBootstrap Percolation on Periodic Trees
We study bootstrap percolation with the threshold parameter θ ≥ 2 and the initial probability p on infinite periodic trees that are defined as follows. Each node of a tree has degree selected from a finite predefined set of non-negative integers, and starting from a given node, called root, all nodes at the same graph distance from the root have the same degree. We show the existence of the cri...
متن کاملBootstrap percolation on Gn,p
Bootstrap percolation on a graph G is defined as the spread of activation or infection according to the following rule, with a given threshold r ≥ 2: We start with a set A(0) ⊆ V (G) of active vertices. Each inactive vertex that has at least r active neigbours becomes active. This is repeated until no more vertices become active, i.e., when no inactive vertex has r or more active neigbours. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2017
ISSN: 1077-8926
DOI: 10.37236/6000